Generating Scenario Trees for Multistage Decision Problems

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Scenario Trees for Multistage Decision Problems

In models of decision making under uncertainty we often are faced with the problem of representing the uncertainties in a form suitable for quantitative models. If the uncertainties are expressed in terms of multivariate continuous distributions, or a discrete distribution with far too many outcomes, we normally face two possibilities: either creating a decision model with internal sampling, or...

متن کامل

Stability and scenario trees for multistage stochastic programs

By extending the stability analysis of [20] for multistage stochastic programs we show that their (approximate) solution sets behave stable with respect to the sum of an Lr-distance and a filtration distance. Based on such stability results we suggest a scenario tree generation method for the (multivariate) stochastic input process. It starts with an initial scenario set and consists of a recur...

متن کامل

Path-dependent scenario trees for multistage stochastic programmes in finance

The formulation of dynamic stochastic programmes for financial applications generally requires the definition of a risk–reward objective function and a financial stochastic model to represent the uncertainty underlying the decision problem. The solution of the optimization problem and the quality of the resulting strategy will depend critically on the adopted financial model and its consistency...

متن کامل

Generating Better Decision Trees

A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the artificial intelligence and machine learning literature. Decision tree size, error rate, and expected classification cost are just a few of the quality measures it can exploit. Furthermore, decision trees of varying qualit...

متن کامل

Generating Decision Trees with Boughs

Because decision trees use greedy algorithms, as a decision tree grows, lower branches have smaller number of training examples than upper branches so that the reliability of lower branches become worse than the upper branches. Therefore, a single tree may lead to unnecessary tests of attributes due to the data fragmentation. In order to improve the fragmentation problem of decision trees, a de...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Management Science

سال: 2001

ISSN: 0025-1909,1526-5501

DOI: 10.1287/mnsc.47.2.295.9834